Large monochromatic components in colorings of complete 3-uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Covering complete partite hypergraphs by monochromatic components
A well-known special case of a conjecture attributed to Ryser (actually appeared in the thesis of Henderson [7]) states that k-partite intersecting hypergraphs have transversals of at most k−1 vertices. An equivalent form of the conjecture in terms of coloring of complete graphs is formulated in [1]: if the edges of a complete graph K are colored with k colors then the vertex set of K can be co...
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملGreedy colorings of uniform hypergraphs
We give a very short proof of an Erdős conjecture that the number of edges in a non-2-colorable n-uniform hypergraph is at least f(n)2, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least c log n. With an ingenious recoloring idea he later proved that f(n) ≥ cn. Here we prove a weaker bound on f(n), namely f(n) ≥ cn. Instead of recoloring a r...
متن کاملKneser Colorings of Uniform Hypergraphs
For xed positive integers r, k and ` with ` < r, and an r-uniform hypergraph H, let κ(H, k, `) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color class intersect in at least ` vertices. Consider the function KC(n, r, k, `) = maxH∈Hn κ(H, k, `), where the maximum runs over the family Hn of all r-uniform hypergraphs on n vertices. In this...
متن کاملHamilton decompositions of complete 3-uniform hypergraphs
A k−uniform hypergraphH is a pair (V, ε), where V = {v1, v2, . . . , vn} is a set of n vertices and ε is a family of k-subset of V called hyperedges. A cycle of length l of H is a sequence of the form (v1, e1, v2, e2, . . . , vl, el, v1), where v1, v2, . . . , vl are distinct vertices, and e1, e2, . . . , el are k-edges of H and vi, vi+1 ∈ ei, 1 ≤ i ≤ l, where addition on the subscripts is modu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.09.004